Thermodynamics of the binary symmetric channel

Thermodynamics of the binary symmetric channel

We study a hidden Markov process which is the result of a transmission of the binary symmetric Markov source over the memoryless binary symmetric channel. This process has been studied extensively in Information Theory and is often used as a benchmark case for the so-called denoising algorithms. Exploiting the link between this process and the 1D Random Field Ising Model (RFIM), we are able to ...

On the Binary Symmetric Wiretap Channel

In this paper, we investigate the binary symmetric wiretap channel. We show that the secrecy capacity can be achieved by using random linear codes. Furthermore, we explore the coset coding scheme constructed by linear codes. As a result, we give an upper bound on the total information loss, which sheds light on the design of the applicable coset codes for the secure transmission with limited in...

On Estimation for a Binary-Symmetric Channel

We consider a binary symmetric channel where the input, modeled as an innnite sequence of bits, is distorted by a Bernoulli noise. In 8], a consistent estimator of the distortion, i.e., of the probability that a single bit is changed, is described under the basic assumption that the complexity of the input is nite. Here, we deal with two shortcomings: 1. Simons' estimator requires some informat...

The Metric Structure of Codes for the Binary Symmetric Channel

Code spectrum and the reliability function: Binary symmetric channel

A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat in a unified way both a low and a high rate cases. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.